Pseudo-BCH Semilattices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Pseudo BCH-algebras

As a generalization of BCH-algebras, the notion of pseudo BHalgebra is introduced, and some of their properties are investigated. The notions of pseudo subalgebra, pseudo ideals, and pseudo atoms in pseudo BCH-algebras are introduced. Characterizations of their properties are provided. Mathematics Subject Classification: 06F35, 03G25

متن کامل

Fuzzy ideals of pseudo-BCH-algebras

Characterizations of fuzzy ideals of a pseudo-BCH-algebra are established. Conditions for a fuzzy set to be a fuzzy ideal are given. The homomorphic properties of fuzzy ideals are provided. Finally, characterizations of Noetherian pseudo-BCH-algebras and Artinian pseudoBCH-algebras via fuzzy ideals are obtained. Mathematics Subject Classi…cation: 03G25, 06F35.

متن کامل

Congruence Lattices of Semilattices

The main result of this paper is that the class of congruence lattices of semilattices satisfies no nontrivial lattice identities. It is also shown that the class of subalgebra lattices of semilattices satisfies no nontrivial lattice identities. As a consequence it is shown that if 5^* is a semigroup variety all of whose congruence lattices satisfy some fixed nontrivial lattice identity, then a...

متن کامل

Semilattices of Breadth Three

A 1984 problem of S. Z. Ditor asks whether there exists a lattice of cardinality א2, with zero, in which every principal ideal is finite and every element has at most three lower covers. We prove that the existence of such a lattice follows from either one of two axioms that are known to be independent of ZFC, namely (1) Martin’s Axiom restricted to collections of א1 dense subsets in posets of ...

متن کامل

Trees as semilattices

We study semilattices whose diagrams are trees. First, we characterize them as semilattices whose convex subsemilattices form a convex geometry, or, equivalently, the closure induced by convex subsemilattices is antiexchange. Then we give lattice theoretic and two graph theoretic characterizations of atomistic semilattices with tree diagrams.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Section of Logic

سال: 2018

ISSN: 2449-836X,0138-0680

DOI: 10.18778/0138-0680.47.2.04